Formal partitioning analysis and verification of extended algebraic automata

Algebraic automata is getting much importance in theoretical computer science because of its various applications, for example, in optimization of programs, verification of protocols, cryptography and modeling biological phenomena. Design of a complex system not only requires functionality but it also needs to capture its control behaviour. This paper is a part of our ongoing research on integration of algebraic automata and formal methods. Algebraic automaton is a powerful tool in modeling behaviour while Z is an ideal specification language used for describing statics of a system. Consequently, an integration of algebraic automata and Z will be a useful tool for modeling of complex systems. In this paper, we have described formal partitioning analysis of extended algebraic automata because of its use in components based modeling. At first, formal specification of constructing sub-automata for given automata is presented. Then equality of two given automata is verified. In next, cycles are identified and finally formal partitioning analysis of extended algebraic automata is provided. The formal specification is checked, analyzed and validated using Z/Eves tool.